Parallel and distributed algorithms for finite constraint satisfaction problems
نویسندگان
چکیده
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. I f an FCSP can be represented b y an acyclic constraint network of sire n with width bounded b y a constant then (1) the parallel algorithm takes O(1ogn) time using O ( n ) processors and (2) there is a mapping of this problem to a distributed computing network of poly(n) processors which stabilizes in O(1ogn) time.
منابع مشابه
Finite Constraint Satisfaction : Complexity , Algorithms and
This paper explores the parallel complexity of nite constraint satisfaction problems (FCSPs) by developing three algorithms for deriving minimal constraint networks in parallel. The rst is a parallel algorithm for the EREW PRAM model, the second is a distributed algorithm for ne-grain interconnected networks, and the third is a distributed algorithm for coarse-grain interconnected networks. Our...
متن کاملA DisCSP Solving Algorithm Based on Sessions
For a few years, there is some interest about solving distributed problems. Particularly, many contributions have been brought in the resolution of distributed constraint satisfaction problems. Most of works tend to propose asynchronous search algorithms. These are always an adaptation of the backtracking principle well known for resolution of centralized CSP. Few interest has been shown about ...
متن کاملDistributed Constraint Satisfaction Problems - A Model and Application
A canonical model for distributed constraint satisfaction problems (DCSP) is presented and algorithms for processing constraints on a DCSP are described. The central idea behind a constraint network that is given as a DCSP is the existence of large dierences between the cost of message passing among dierent components of a DCSP and the cost of local consistency checks within each component. The...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملStrategies for Distributed Constraint Satisfaction Problems
Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributed-agent-based, parallel-agent-based, and function-agent-based distributed problem-solving strategies. These different strategies are presented and discussed. Parallel-agentbased strateg...
متن کامل